Duality in nonlinear approximation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A DUALITY APPROXIMATION OF SOME NONLINEAR PDE’s∗

We discuss a discretization approach for the p Laplacian equation and a variational inequality associated to fourth order elliptic operators, via a meshless approach based on duality theory. MSC: 35J20, 35J25, 65N99. keywords: nonlinear elliptic equations, Fenchel theorem, approximation, meshless method.

متن کامل

Duality in nonlinear programming

In this paper are defined new firstand second-order duals of the nonlinear programming problem with inequality constraints. We introduce a notion of a WD-invex problem. We prove weak, strong, converse, strict converse duality, and other theorems under the hypothesis that the problem is WD-invex. We obtain that a problem with inequality constraints is WD-invex if and only if weak duality holds b...

متن کامل

Self - Duality in Nonlinear Electromagnetism

We discuss duality invariant interactions between electromagnetic fields and matter. The case of scalar fields is treated in some detail. ∗Contribution to the memorial volume for D.V. Volkov. †This work was supported in part by the Director, Office of Energy Research, Office of High Energy and Nuclear Physics, Division of High Energy Physics of the U.S. Department of Energy under Contract DE-AC...

متن کامل

Nonlinear approximation

This is a survey of nonlinear approximation, especially that part of the subject which is important in numerical computation. Nonlinear approximation means that the approximants do not come from linear spaces but rather from nonlinear manifolds. The central question to be studied is what, if any, are the advantages of nonlinear approximation over the simpler, more established, linear methods. T...

متن کامل

Duality and nonlinear graph Laplacians

We present an iterative algorithm for solving a class of nonlinear Laplacian system of equations in Õ(km log(kn/ǫ)) iterations, where k is a measure of nonlinearity, n is the number of variables, m is the number of nonzero entries in the graph Laplacian L, ǫ is the solution accuracy and Õ() neglects (non-leading) logarithmic terms. This algorithm is a natural nonlinear extension of the one by o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1969

ISSN: 0021-9045

DOI: 10.1016/0021-9045(69)90037-9